منابع مشابه
Asymptotic Formulae
Let ts,n be the n-th positive integer number which can be written as a power p, t ≥ s, of a prime p (s ≥ 1 is fixed). Let πs(x) denote the number of prime powers p, t ≥ s, not exceeding x. We study the asymptotic behaviour of the sequence ts,n and of the function πs(x). We prove that the sequence ts,n has an asymptotic expansion comparable to that of pn (the Cipolla’s expansion).
متن کاملFeatures and Formulae
Feature structures are a representational device used in several current linguistic theories. This paper shows how these structures can be axiomatized in a decidable class of first-order logic, which can also be used to express constraints on these structures. Desirable properties, such as compactness and decidability, follow directly. Moreover, additional types of feature values, such as "set-...
متن کاملParafermionic Character Formulae
We study various aspects of parafermionic theories such as the precise field content, a description of a basis of states (that is, the counting of independent states in a freely generated highest-weight module) and the explicit expression of the parafermionic singular vectors in completely irreducible modules. This analysis culminates in the presentation of new character formulae for the Z N pa...
متن کاملOn Constructing Minimal Formulae
Given a Boolean propositional formula, φ(Xn) over the basis Ω = {∧,∨,¬} we consider the following decision problem: is there a subset of literals, S, for which φ(Xn) ≡ ∧ y∈S y or φ(Xn) ≡ ∨ y∈S y? We prove that the “obvious” Σ p 2 upper bound is sub-optimal and that the problem is decidable in PNP || the class of languages decidable by polynomial time methods allowed to make non-adaptive queries...
متن کاملVivifying Propositional Clausal Formulae
In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our approach aims at improving the filtering power of the original clauses while producing a small number of additional and relevant clauses. More precisely, an incomplete redundancy check is performed on each original clauses through...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lietuvos matematikos rinkinys
سال: 2013
ISSN: 2335-898X,0132-2818
DOI: 10.15388/lmr.b.2013.26